Semi-intuitionistic Logic with Strong Negation

نویسندگان

  • Juan Manuel Cornejo
  • Ignacio Darío Viglizzo
چکیده

There is a well known interplay between the study of algebraic varieties and propositional calculus of various logics. Prime examples of this are boolean algebras and classical logic, and Heyting algebras and intuitionistic logic. After the class of Heyting algebras was generalized to the semi-Heyting algebras by H. Sankappanavar in [San08], its logic counterpart was developed by one of us in [Cor11] and further studied in [CV15]. Nelson algebras, or N-lattices were defined by H. Rasiowa [Ras58] to provide an algebraic semantics to the constructive logic with strong negation proposed by Nelson in [Nel49]. D. Vakarelov in [Vak77] presented a construction of Nelson algebras staring from Heyting ones. Applying this construction to semi-Heyting algebras, we obtained in [CV16] the variety of semi-Nelson algebras as a natural generalization of Nelson algebras. In this variety, the lattice of congruences of an algebra is determined through some of its deductive systems. Furthermore, the class of semi-Nelson algebras is arithmetical, has equationally definable principal congruences and has the congruence extension property. It is the purpose of this work to present a Hilbert-style propositional calculus which is complete with respect to the algebras in this variety. Naming this logic semi-intuitionistic logic with strong negation was a natural choice. We believe that this logic will be of interest from the point of view of Many-Valued Logic, since its algebraic semantics show that it can provide many different interpretations for the implication connective. For example, on a chain with five elements, ten different semi-Nelson algebras may be defined, by changing the implication operation. We present the algebraic motivation, defining semi-Nelson and semi-Heyting algebras. We then introduce the axioms and inference rule for the semi-intuitionistic logic with strong negation, together with some of their consequences. Finally we deal with completeness of the logic with respect to the class of semi-Nelson algebras, and present an axiomatic extension that has the variety of Nelson algebras as its algebraic semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proofs, Disproofs, and Their Duals

Bi-intuitionistic logic, also known as Heyting-Brouwer logic or subtractive logic, is extended in various ways by a strong negation connective used to express commitments arising from denials. These logics have been introduced and investigated in [48]. In the present paper, an inferentialist semantics in terms of proofs, disproofs, and their duals is developed. Whereas the Brouwer-Heyting-Kolmo...

متن کامل

Self-Contradiction Degrees in Intuitionistic Fuzzy Logic

This paper is an attempt to model to what extent an intuitionistic fuzzy set is self-contradictory, both in the case of selfcontradiction regarding a strong intuitionistic negation, and without depending on a specific negation. For this purpose, firstly, a geometrical study on self-contradiction regarding a negation is considered; afterwards some functions to measure degrees of self-contradicto...

متن کامل

The Craig interpolation theorem for prepositional logics with strong negation

This paper deals with propositional calculi with strong negation(N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them. " A propositional calculus with stro...

متن کامل

Intuitionistic Logic with a “ Definitely ” Operator by Peter Mott January 1997

This paper introduces a logic ILED derived from standard intuitionistic sentence logic by adding two operators Dϕ for " Definitely ϕ " and ~ϕ for " Experience rejects ϕ ". A further negation ¬ϕ = def (ϕ→⊥) ∨ ~ϕ , which we call real negation, is introduced. Real negation is like intuitionistic negation when there are no D-operators but deviates when there are. We see that Dϕ ↔ ϕ is valid but ¬Dϕ...

متن کامل

Intuitionistic Logic with a “Definitely” Operator

This paper introduces a logic ILED derived from standard intuitionistic predicate logic by adding two operators Dφ for “Definitely φ” and ~φ for “Experience rejects φ”. A further negation ¬φ =def (φ→⊥) ∨ ~φ , which we call real negation, is introduced. Real negation is like intuitionistic negation when there are no D-operators but deviates when there are. We see that Dφ ↔ φ is valid but ¬Dφ → ¬...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 106  شماره 

صفحات  -

تاریخ انتشار 2018